An Algorithm for Permuting Variables of Recursively Represented Polynomials
نویسندگان
چکیده
A straightforward way to represent multivariate polynomial in software is to implement them recursively as univariate polynomials over a polynomial ring. This is especially common in an object oriented context. We present a short algorithm which maps polynomials from one polynomial ring to another polynomial ring where the order of variables is permuted. This algorithm uses the recursive representation and does not change to another representation.
منابع مشابه
Two Universal 3-quantifier Representations of Recursively Enumerable Sets
1. Let us agree on the following notation. Lower-case Latin letters from a to n (inclusively) with indices and without them will be used as variables for nonnegative integers, the remaining lower-case Latin letters will be used as variables for integers. Analogously, lower case Greek letters from to will be used as metavariables for nonnegative integers, and the rest of the Greek letters will b...
متن کاملUndecidable Diophantine Equations
In 1900 Hubert asked for an algorithm to decide the solvability of all diophantine equations, P(x1, . . . , xv) = 0, where P is a polynomial with integer coefficients. In special cases of Hilbert's tenth problem, such algorithms are known. Siegel [7] gives an algorithm for all polynomials P(xx, . . . , xv) of degree < 2. From the work of A. Baker [1] we know that there is also a decision proced...
متن کاملA Fast and Efficient On-Line Harmonics Elimination Pulse Width Modulation for Voltage Source Inverter Using Polynomials Curve Fittings
The paper proposes an algorithm to calculate the switching angles using harmonic elimination PWM (HEPWM) scheme for voltage source inverter. The algorithm is based on curve fittings of a certain polynomials functions. The resulting equations require only the addition and multiplication processes; therefore, it can be implemented efficiently on a microprocessor. An extensive angle error analysis...
متن کاملA numerical Algorithm Based on Chebyshev Polynomials for Solving some Inverse Source Problems
In this paper, two inverse problems of determining an unknown source term in a parabolic equation are considered. First, the unknown source term is estimated in the form of a combination of Chebyshev functions. Then, a numerical algorithm based on Chebyshev polynomials is presented for obtaining the solution of the problem. For solving the problem, the operational matrices of int...
متن کاملThe coefficients of differentiated expansions of double and triple Jacobi polynomials
Formulae expressing explicitly the coefficients of an expansion of double Jacobi polynomials which has been partially differentiated an arbitrary number of times with respect to its variables in terms of the coefficients of the original expansion are stated and proved. Extension to expansion of triple Jacobi polynomials is given. The results for the special cases of double and triple ultraspher...
متن کامل